Multiplication of Polynomials using Discrete Fourier Transformation

Faster Polynomial Multiplication via Discrete Fourier Transforms

We study the complexity of polynomial multiplication over arbitrary fields. We present a unified approach that generalizes all known asymptotically fastest algorithms for this problem. In particular, the well-known algorithm for multiplication of polynomials over fields supporting DFTs of large smooth orders, Schönhage-Strassen’s algorithm over arbitrary fields of characteristic different from ...

Authentication and Secret Message Transmission Technique Using Discrete Fourier Transformation

In this paper a novel technique, Authentication and Secret Message Transmission using Discrete Fourier Transformation (ASMTDFT) has been proposed to authenticate an image and also some secret message or image can be transmitted over the network. Instead of direct embedding a message or image within the source image, choosing a window of size 2 x 2 of the source image in sliding window manner an...

Fast Polynomials Multiplication Using FFT

Algebraic adjoint of the polynomials-polynomial matrix multiplication

This paper deals with a result concerning the algebraic dual of the linear mapping defined by the multiplication of polynomial vectors by a given polynomial matrix over a commutative field

Discrete Fourier Analysis and Chebyshev Polynomials with G2 Group

Abstract. The discrete Fourier analysis on the 300–600–900 triangle is deduced from the corresponding results on the regular hexagon by considering functions invariant under the group G2, which leads to the definition of four families generalized Chebyshev polynomials. The study of these polynomials leads to a Sturm–Liouville eigenvalue problem that contains two parameters, whose solutions are ...